Towards NP−P via Proof Complexity and Search Draft — Comments Appreciated
نویسنده
چکیده
This is a survey of work on proof complexity and proof search, as motivated by the P versus NP problem. We discuss propositional proof complexity, Cook’s program, proof automatizability, proof search, algorithms for satisfiability, and the state of the art of our (in)ability to separate P and NP .
منابع مشابه
Towards NP-P via proof complexity and search
This is a survey of work on proof complexity and proof search from a logicoalgorithmic viewpoint, as motivated by the P versus NP problem. We discuss propositional proof complexity, Cook’s program, proof automatizability, proof search, algorithms for satisfiability, and the state of the art of our (in)ability to separate P and NP .
متن کاملOn Teaching the Basics of Complexity Theory
We outline a conceptual framework for teaching the basic notions and results of complexity theory. Our focus is on using deenitions and on organizing the presentation in a way that reeects the fundamental nature of the material. We do not attempt to provide a self-contained presentation of the material itself, but rather outline our suggestions regarding how this material should be presented in...
متن کاملOn the computational complexity of finding hard tautologies
It is well-known (cf. K.-Pudlák[18]) that a polynomial time algorithm finding tautologies hard for a propositional proof system P exists iff P is not optimal. Such an algorithm takes 1 (k) and outputs a tautology τ k of size at least k such that P is not p-bounded on the set of all τ k 's. We consider two more general search problems involving finding a hard formula, Cert and Find, motivated by...
متن کاملThe Primacy of Teacher Imperative Commentaries in the Improvement of Iranian English Majors’ Writing Ability
In this study, the researchers investigated a critical aspect of EFL/ESL writing pedagogy-the impact of teacher written commentary on student writer’s earlier drafts. Compositions of 80 Iranian undergraduate English majors were commented on using a trio of imperatives, statements, and questions on both content and form. Overall, the results indicated that the comments in the imperative form hel...
متن کاملP-Selective Sets, and Reducing Search to Decision vs. Self-Reducability
We obtain several results that distinguish self-reducibility of a language L with the question of whether search reduces to decision for L. These include: (i) If NE 6 = E, then there exists a set L in NP ? P such that search reduces to decision for L, search does not nonadaptively reduces to decision for L, and L is not self-reducible. 1 (ii) If UE 6 = E, then there exists a language L 2 UP ? P...
متن کامل